Decidable classes of number-theoretic sentences
نویسندگان
چکیده
منابع مشابه
Decidable Equational Classes
I will discuss the progress that has been made on solving two open problems dealing with the decidability of the first order theory of equationally defined classes of algebras (varieties).
متن کاملA Number Theoretic Interpolation Between Quantum and Classical Complexity Classes
We reveal a natural algebraic problem whose complexity appears to interpolate between the well-known complexity classes BQP and NP: ⋆ Decide whether a univariate polynomial with exactly m monomial terms has a p-adic rational root. In particular, we show that while (⋆) is doable in quantum randomized polynomial time when m=2 (and no classical randomized polynomial time algorithm is known), (⋆) i...
متن کاملFinitely-Verifiable Classes of Sentences
This paper proposes a notion of finitely-verifiable classes of sentences. Informally, a class of sentences is finitely-verifiable if whether a sentence in this class is a theorem of a given theory can be checked with respect to a finite set of models of the theory. The usefulness of this notion is illustrated using examples from arithmetics, first-order logic, game theory, and planning.
متن کاملEnumerations of Pi10 Classes: Acceptability and Decidable Classes
A Π1 class is an effectively closed set of reals. One way to view it is as the set of infinite paths through a computable tree. We consider the notion of acceptably equivalent numberings of Π1 classes. We show that a permutation exists between any two acceptably equivalent numberings that preserves the computable content. Furthermore the most commonly used numberings of the Π1 classes are accep...
متن کاملDecidable classes of documents for XPath
We study the satisfiability problem for XPath over XML documents of bounded depth. We define two parameters, called match width and braid width, that assign a number to any class of documents. We show that for all k, satisfiability for XPath restricted to bounded depth documents with match width at most k is decidable; and that XPath is undecidable on any class of documents with unbounded braid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Zeitschrift für Mathematische Logik und Grundlagen der Mathematik
سال: 1969
ISSN: 0044-3050,1521-3870
DOI: 10.1002/malq.19690152602